A general probabilistic database model
نویسندگان
چکیده
A new model for probabilistic databases, using interval-valued conditional probability assessments, is proposed. The concept of coherence adopted in our approach is based on a suitable generalization of the coherence principle of de Finetti and can be related to similar definitions given for lower and upper probabilities by other authors. A corresponding probabilistic relational algebra is introduced and some new operators are defined. Finally, some simple examples are given.
منابع مشابه
A Probabilistic Model of Learning Fields in Islamic Economics and Finance
In this paper an epistemological model of learning fields of probabilistic events is formalized. It is used to explain resource allocation governed by pervasive complementarities as the sign of unity of knowledge. Such an episteme is induced epistemologically into interacting, integrating and evolutionary variables representing the problem at hand. The end result is the formalization of a p...
متن کاملA Trust Based Probabilistic Method for Efficient Correctness Verification in Database Outsourcing
Correctness verification of query results is a significant challenge in database outsourcing. Most of the proposed approaches impose high overhead, which makes them impractical in real scenarios. Probabilistic approaches are proposed in order to reduce the computation overhead pertaining to the verification process. In this paper, we use the notion of trust as the basis of our probabilistic app...
متن کاملA Probabilistic Model for COPD Diagnosis and Phenotyping Using Bayesian Networks
Introduction: This research was meant to provide a model for COPD diagnosis and to classify the cases into phenotypes; General COPD, Chronic bronchitis, Emphysema, and the Asthmatic COPD using a Bayesian Network (BN). Methods: The model was constructed through developing the Bayesian Network structure and instantiating the parameters for each of the variables. In order to validate the achiev...
متن کاملChapter 2 MODELS FOR INCOMPLETE AND PROBABILISTIC INFORMATION
We discuss, compare and relate some old and some new models for incomplete and probabilistic databases. We characterize the expressive power of c-tables over infinite domains and we introduce a new kind of result, algebraic completion, for studying less expressive models. By viewing probabilistic models as incompleteness models with additional probability information, we define completeness and...
متن کاملA Probabilistic Approach to Navigation in Hypertext
One of the main unsolved problems confronting Hypertext is the navigation problem namely the problem of having to know where you are in the database graph representing the structure of a Hypertext database and knowing how to get to some other place you are searching for in the database graph Previously we formalised a Hypertext database in terms of a directed graph whose nodes represent pages o...
متن کامل